New Bounds on the Minimum Average Distance of Binary Codes
نویسندگان
چکیده
منابع مشابه
Lower bounds on the minimum average distance of binary codes
Let β(n,M) denote the minimum average Hamming distance of a binary code of length n and cardinality M. In this paper we consider lower bounds on β(n,M). All the known lower bounds on β(n,M) are useful when M is at least of size about 2n−1/n. We derive new lower bounds which give good estimations when size of M is about n. These bounds are obtained using linear programming approach. In particula...
متن کاملNew minimum distance bounds for linear codes over GF(5)
Let [n; k; d]q-codes be linear codes of length n, dimension k and minimum Hamming distance d over GF(q). In this paper, 32 new codes over GF(5) are constructed and the nonexistence of 51 codes is proved. c © 2003 Elsevier B.V. All rights reserved.
متن کاملUpper bounds on the minimum distance of spherical codes
We use linear programming techniques to obtain new upper bounds on the maximal squared minimum distance of spherical codes with fixed cardinality. Functions Qj(n, s) are introduced with the property that Qj(n, s) < 0 for some j > m iff the Levenshtein bound Lm(n, s) on A(n, s) = max{|W | : W is an (n, |W |, s) code} can be improved by a polynomial of degree at least m+1. General conditions on t...
متن کاملOn the Minimum Distance of Non Binary LDPC Codes
Minimum distance is an important parameter of a linear error correcting code. For improved performance of binary Low Density Parity Check (LDPC) codes, we need to have the minimum distance grow fast with n, the codelength. However, the best we can hope for is a linear growth in dmin with n. For binary LDPC codes, the necessary and sufficient conditions on the LDPC ensemble parameters, to ensure...
متن کاملMinimum Distance of Binary Nonlinear Codes∗
A binary nonlinear code can be represented as the union of cosets of a binary linear subcode. Using this representation, new algorithms methods to compute the minimum Hamming weight and distance are presented. The performance of these algorithms is also studied.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scientific Research
سال: 2010
ISSN: 2070-0245,2070-0237
DOI: 10.3329/jsr.v2i3.2708